Proto-derivatives and the Geometry of Solution Mappings in Nonlinear Programming
نویسندگان
چکیده
We quantify the sensitivity of KKT pairs associated with a parameterized family of nonlinear programming problems. Our approach involves proto-derivatives, which are generalized derivatives appropriate even in cases when the KKT pairs are not unique; we investigate what the theory of such derivatives yields in the special case when the KKT pairs are unique (locally). We demonstrate that the graph of the KKT multifunction is just a reoriented graph of a Lipschitz mapping, and use proto-differentiability to show that the graph of the KKT multifunction actually has the stronger property of being a reorientation of the graph of a B-differentiable mapping. Our results indicate that protoderivatives provide the same kind of information for possibly set-valued mappings (like the KKT multifunction) that B-derivatives provide for single-valued mappings.
منابع مشابه
Some fixed point theorems for weakly subsequentially continuous and compatible of type (E) mappings with an application
In this paper, we will establish some xed point results for two pairs of self mappings satisfying generalized contractive condition by using a new concept as weak subsequential continuity with compatibility of type (E) in metric spaces, as an application the existence of unique common solution for a system of functional equations arising in system programming is proved.
متن کاملA dynamic programming approach for solving nonlinear knapsack problems
Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
متن کاملOn Best Proximity Points in metric and Banach spaces
Notice that best proximity point results have been studied to find necessaryconditions such that the minimization problemminx∈A∪Bd(x,Tx)has at least one solution, where T is a cyclic mapping defined on A∪B.A point p ∈ A∪B is a best proximity point for T if and only if thatis a solution of the minimization problem (2.1). Let (A,B) be a nonemptypair in a normed...
متن کاملNonlinear Vibration Analysis of a cantilever beam with nonlinear geometry
Analyzing the nonlinear vibration of beams is one of the important issues in structural engineering. According to this, an impressive analytical method which is called Modified Iteration Perturbation Method (MIPM) is used to obtain the behavior and frequency of a cantilever beam with geometric nonlinear. This new method is combined by the Mickens and Iteration methods. Moreover, this method don...
متن کاملInversion of Gravity Data by Constrained Nonlinear Optimization based on nonlinear Programming Techniques for Mapping Bedrock Topography
A constrained nonlinear optimization method based on nonlinear programming techniques has been applied to map geometry of bedrock of sedimentary basins by inversion of gravity anomaly data. In the inversion, the applying model is a 2-D model that is composed of a set of juxtaposed prisms whose lower depths have been considered as unknown model parameters. The applied inversion method is a nonli...
متن کامل